0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.33 % Computer : n006.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1920 0.11/0.33 % WCLimit : 240 0.11/0.33 % DateTime : Wed Jul 30 05:56:04 EDT 2025 0.11/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p 0.20/0.57 # Version: 3.0.0-ho 0.20/0.57 # Preprocessing class: HSMMSLSSLLLNHFA. 0.20/0.57 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.57 # Starting new_ho_10_cnf2 with 1200s (5) cores 0.20/0.57 # Starting post_as_ho1 with 240s (1) cores 0.20/0.57 # Starting post_as_ho5 with 240s (1) cores 0.20/0.57 # Starting post_as_ho10 with 240s (1) cores 0.20/0.57 # post_as_ho5 with pid 14946 completed with status 0 0.20/0.57 # Result found by post_as_ho5 0.20/0.57 # Preprocessing class: HSMMSLSSLLLNHFA. 0.20/0.57 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.57 # Starting new_ho_10_cnf2 with 1200s (5) cores 0.20/0.57 # Starting post_as_ho1 with 240s (1) cores 0.20/0.57 # Starting post_as_ho5 with 240s (1) cores 0.20/0.57 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.57 # Search class: HGUSM-FFSS21-SHFMMSBN 0.20/0.57 # partial match(2): HGUSM-FFSS32-SHFMMSBN 0.20/0.57 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.57 # Starting ho_unfolding_3 with 130s (1) cores 0.20/0.57 # ho_unfolding_3 with pid 14948 completed with status 0 0.20/0.57 # Result found by ho_unfolding_3 0.20/0.57 # Preprocessing class: HSMMSLSSLLLNHFA. 0.20/0.57 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.57 # Starting new_ho_10_cnf2 with 1200s (5) cores 0.20/0.57 # Starting post_as_ho1 with 240s (1) cores 0.20/0.57 # Starting post_as_ho5 with 240s (1) cores 0.20/0.57 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.57 # Search class: HGUSM-FFSS21-SHFMMSBN 0.20/0.57 # partial match(2): HGUSM-FFSS32-SHFMMSBN 0.20/0.57 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.57 # Starting ho_unfolding_3 with 130s (1) cores 0.20/0.57 # Preprocessing time : 0.003 s 0.20/0.57 # Presaturation interreduction done 0.20/0.57 0.20/0.57 # Proof found! 0.20/0.57 # SZS status Theorem 0.20/0.57 # SZS output start CNFRefutation 0.20/0.57 thf(decl_sort1, type, term: $tType). 0.20/0.57 thf(decl_sort2, type, subst: $tType). 0.20/0.57 thf(decl_23, type, one: term). 0.20/0.57 thf(decl_26, type, sub: term > subst > term). 0.20/0.57 thf(decl_28, type, sh: subst). 0.20/0.57 thf(decl_29, type, push: term > subst > subst). 0.20/0.57 thf(decl_30, type, comp: subst > subst > subst). 0.20/0.57 thf(decl_31, type, var: term > $o). 0.20/0.57 thf(decl_46, type, ulamvar1: $o). 0.20/0.57 thf(decl_72, type, ulamvarind: $o). 0.20/0.57 thf(decl_83, type, axclos: $o). 0.20/0.57 thf(decl_86, type, pushprop_lthm: $o). 0.20/0.57 thf(decl_93, type, axvarcons: $o). 0.20/0.57 thf(decl_101, type, pushprop_lem0: $o). 0.20/0.57 thf(decl_117, type, pushprop: $o). 0.20/0.57 thf(decl_137, type, axshiftcons: $o). 0.20/0.57 thf(decl_142, type, pushprop_p_and_p_prime: term > subst > (term > $o) > (term > $o) > $o). 0.20/0.57 thf(decl_145, type, epred1_3: (term > $o) > term > subst > term > $o). 0.20/0.57 thf(decl_146, type, esk1_1: (term > $o) > term). 0.20/0.57 thf(decl_147, type, epred2_0: term > $o). 0.20/0.57 thf(decl_148, type, esk2_0: term). 0.20/0.57 thf(decl_149, type, esk3_0: subst). 0.20/0.57 thf(decl_150, type, esk4_0: term). 0.20/0.57 thf(pushprop_lthm, axiom, ((pushprop_lthm)<=>((pushprop_lem0)=>((ulamvar1)=>((axvarcons)=>((axclos)=>((axshiftcons)=>((ulamvarind)=>(pushprop)))))))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', pushprop_lthm)). 0.20/0.57 thf(pushprop_lem0, axiom, ((pushprop_lem0)<=>![X6:term > $o, X1:term, X3:subst]:(?[X9:term > $o]:((pushprop_p_and_p_prime @ X1 @ X3 @ X6 @ X9)))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', pushprop_lem0)). 0.20/0.57 thf(ulamvar1, axiom, ((ulamvar1)<=>(var @ one)), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', ulamvar1)). 0.20/0.57 thf(axvarcons, axiom, ((axvarcons)<=>![X1:term, X3:subst]:(((sub @ one @ (push @ X1 @ X3))=(X1)))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', axvarcons)). 0.20/0.57 thf(axclos, axiom, ((axclos)<=>![X1:term, X3:subst, X4:subst]:(((sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', axclos)). 0.20/0.57 thf(axshiftcons, axiom, ((axshiftcons)<=>![X1:term, X3:subst]:(((comp @ sh @ (push @ X1 @ X3))=(X3)))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', axshiftcons)). 0.20/0.57 thf(ulamvarind, axiom, ((ulamvarind)<=>![X6:term > $o]:(((X6 @ one)=>(![X1:term]:(((var @ X1)=>((X6 @ X1)=>(X6 @ (sub @ X1 @ sh)))))=>![X1:term]:(((var @ X1)=>(X6 @ X1))))))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', ulamvarind)). 0.20/0.57 thf(pushprop, axiom, ((pushprop)<=>![X6:term > $o, X1:term, X3:subst]:((![X2:term]:(((var @ X2)=>(X6 @ (sub @ X2 @ X3))))=>((X6 @ X1)=>![X2:term]:(((var @ X2)=>(X6 @ (sub @ X2 @ (push @ X1 @ X3))))))))), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', pushprop)). 0.20/0.57 thf(thm, conjecture, (pushprop_lthm), file('/export/starexec/sandbox2/tmp/tmp.yrpqkJ0GfN/E---3.1_14866.p', thm)). 0.20/0.57 thf(c_0_9, axiom, ((pushprop_lthm)=(((![X47:term > $o, X48:term, X49:subst]:(?[X50:term > $o]:((pushprop_p_and_p_prime @ X48 @ X49 @ X47 @ X50))))=>(((var @ one))=>((![X51:term, X52:subst]:(((sub @ one @ (push @ X51 @ X52))=(X51))))=>((![X53:term, X54:subst, X55:subst]:(((sub @ (sub @ X53 @ X54) @ X55)=(sub @ X53 @ (comp @ X54 @ X55)))))=>((![X56:term, X57:subst]:(((comp @ sh @ (push @ X56 @ X57))=(X57))))=>((![X58:term > $o]:(((X58 @ one)=>(![X59:term]:(((var @ X59)=>((X58 @ X59)=>(X58 @ (sub @ X59 @ sh)))))=>![X60:term]:(((var @ X60)=>(X58 @ X60)))))))=>(![X61:term > $o, X62:term, X63:subst]:((![X64:term]:(((var @ X64)=>(X61 @ (sub @ X64 @ X63))))=>((X61 @ X62)=>![X65:term]:(((var @ X65)=>(X61 @ (sub @ X65 @ (push @ X62 @ X63))))))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pushprop_lthm, pushprop_lem0]), ulamvar1]), axvarcons]), axclos]), axshiftcons]), ulamvarind]), pushprop])). 0.20/0.57 thf(c_0_10, negated_conjecture, ~((![X66:term > $o, X67:term, X68:subst]:(?[X69:term > $o]:((pushprop_p_and_p_prime @ X67 @ X68 @ X66 @ X69)))=>((var @ one)=>(![X70:term, X71:subst]:(((sub @ one @ (push @ X70 @ X71))=(X70)))=>(![X72:term, X73:subst, X74:subst]:(((sub @ (sub @ X72 @ X73) @ X74)=(sub @ X72 @ (comp @ X73 @ X74))))=>(![X75:term, X76:subst]:(((comp @ sh @ (push @ X75 @ X76))=(X76)))=>(![X77:term > $o]:(((X77 @ one)=>(![X78:term]:(((var @ X78)=>((X77 @ X78)=>(X77 @ (sub @ X78 @ sh)))))=>![X79:term]:(((var @ X79)=>(X77 @ X79))))))=>![X80:term > $o, X81:term, X82:subst]:((![X83:term]:(((var @ X83)=>(X80 @ (sub @ X83 @ X82))))=>((X80 @ X81)=>![X84:term]:(((var @ X84)=>(X80 @ (sub @ X84 @ (push @ X81 @ X82))))))))))))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_9])). 0.20/0.57 thf(c_0_11, negated_conjecture, ![X85:term > $o, X86:term, X87:subst, X89:term, X90:subst, X91:term, X92:subst, X93:subst, X94:term, X95:subst, X96:term > $o, X98:term, X102:term]:(((pushprop_p_and_p_prime @ X86 @ X87 @ X85 @ (epred1_3 @ X85 @ X86 @ X87))&((var @ one)&(((sub @ one @ (push @ X89 @ X90))=(X89))&(((sub @ (sub @ X91 @ X92) @ X93)=(sub @ X91 @ (comp @ X92 @ X93)))&(((comp @ sh @ (push @ X94 @ X95))=(X95))&((((var @ (esk1_1 @ X96))|(~(var @ X98)|(X96 @ X98))|~(X96 @ one))&(((X96 @ (esk1_1 @ X96))|(~(var @ X98)|(X96 @ X98))|~(X96 @ one))&(~(X96 @ (sub @ (esk1_1 @ X96) @ sh))|(~(var @ X98)|(X96 @ X98))|~(X96 @ one))))&((~(var @ X102)|(epred2_0 @ (sub @ X102 @ esk3_0)))&((epred2_0 @ esk2_0)&((var @ esk4_0)&~(epred2_0 @ (sub @ esk4_0 @ (push @ esk2_0 @ esk3_0))))))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])). 0.20/0.57 thf(c_0_12, negated_conjecture, ![X1:term, X6:term > $o]:(((X6 @ X1)|~((X6 @ (sub @ (esk1_1 @ X6) @ sh)))|~((var @ X1))|~((X6 @ one)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_13, negated_conjecture, ![X1:term, X3:subst, X4:subst]:(((sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_14, negated_conjecture, ![X1:term, X3:subst]:(((comp @ sh @ (push @ X1 @ X3))=(X3))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_15, negated_conjecture, ![X1:term]:((((sub @ (esk1_1 @ (^[Z0/* 4 */:term]:(((Z0)!=(X1))))) @ sh)=(X1))|((one)=(X1))|~((var @ X1)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_12])). 0.20/0.57 thf(c_0_16, negated_conjecture, (var @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_17, negated_conjecture, ![X1:term, X6:term > $o]:(((var @ (esk1_1 @ X6))|(X6 @ X1)|~((var @ X1))|~((X6 @ one)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_18, negated_conjecture, ![X1:term, X2:term, X3:subst]:(((sub @ (sub @ X1 @ sh) @ (push @ X2 @ X3))=(sub @ X1 @ X3))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.20/0.57 thf(c_0_19, negated_conjecture, (((sub @ (esk1_1 @ (^[Z0/* 4 */:term]:(((Z0)!=(esk4_0))))) @ sh)=(esk4_0))|((esk4_0)=(one))), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.20/0.57 thf(c_0_20, negated_conjecture, ![X6:term > $o]:(((var @ (esk1_1 @ X6))|(X6 @ esk4_0)|~((X6 @ one)))), inference(spm,[status(thm)],[c_0_17, c_0_16])). 0.20/0.57 thf(c_0_21, negated_conjecture, ![X1:term]:(((epred2_0 @ (sub @ X1 @ esk3_0))|~((var @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_22, negated_conjecture, ![X1:term, X3:subst]:((((sub @ esk4_0 @ (push @ X1 @ X3))=(sub @ (esk1_1 @ (^[Z0/* 4 */:term]:(((Z0)!=(esk4_0))))) @ X3))|((esk4_0)=(one)))), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.20/0.57 thf(c_0_23, negated_conjecture, (((esk4_0)=(one))|(var @ (esk1_1 @ (^[Z0/* 4 */:term]:(((Z0)!=(esk4_0))))))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_20])). 0.20/0.57 thf(c_0_24, negated_conjecture, ~((epred2_0 @ (sub @ esk4_0 @ (push @ esk2_0 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_25, negated_conjecture, ![X1:term]:((((esk4_0)=(one))|(epred2_0 @ (sub @ esk4_0 @ (push @ X1 @ esk3_0))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])). 0.20/0.57 thf(c_0_26, negated_conjecture, ((esk4_0)=(one)), inference(spm,[status(thm)],[c_0_24, c_0_25])). 0.20/0.57 thf(c_0_27, negated_conjecture, ![X3:subst, X1:term]:(((sub @ one @ (push @ X1 @ X3))=(X1))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_28, negated_conjecture, (epred2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.57 thf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_26]), c_0_27]), c_0_28])]), ['proof']). 0.20/0.57 # SZS output end CNFRefutation 0.20/0.57 # Parsed axioms : 238 0.20/0.57 # Removed by relevancy pruning/SinE : 229 0.20/0.57 # Initial clauses : 12 0.20/0.57 # Removed in clause preprocessing : 0 0.20/0.57 # Initial clauses in saturation : 12 0.20/0.57 # Processed clauses : 198 0.20/0.57 # ...of these trivial : 3 0.20/0.57 # ...subsumed : 97 0.20/0.57 # ...remaining for further processing : 98 0.20/0.57 # Other redundant clauses eliminated : 1 0.20/0.57 # Clauses deleted for lack of memory : 0 0.20/0.57 # Backward-subsumed : 1 0.20/0.57 # Backward-rewritten : 39 0.20/0.57 # Generated clauses : 641 0.20/0.57 # ...of the previous two non-redundant : 628 0.20/0.57 # ...aggressively subsumed : 0 0.20/0.57 # Contextual simplify-reflections : 1 0.20/0.57 # Paramodulations : 613 0.20/0.57 # Factorizations : 0 0.20/0.57 # NegExts : 3 0.20/0.57 # Equation resolutions : 2 0.20/0.57 # Disequality decompositions : 0 0.20/0.57 # Total rewrite steps : 236 0.20/0.57 # ...of those cached : 159 0.20/0.57 # Propositional unsat checks : 0 0.20/0.57 # Propositional check models : 0 0.20/0.57 # Propositional check unsatisfiable : 0 0.20/0.57 # Propositional clauses : 0 0.20/0.57 # Propositional clauses after purity: 0 0.20/0.57 # Propositional unsat core size : 0 0.20/0.57 # Propositional preprocessing time : 0.000 0.20/0.57 # Propositional encoding time : 0.000 0.20/0.57 # Propositional solver time : 0.000 0.20/0.57 # Success case prop preproc time : 0.000 0.20/0.57 # Success case prop encoding time : 0.000 0.20/0.57 # Success case prop solver time : 0.000 0.20/0.57 # Current number of processed clauses : 43 0.20/0.57 # Positive orientable unit clauses : 11 0.20/0.57 # Positive unorientable unit clauses: 3 0.20/0.57 # Negative unit clauses : 1 0.20/0.57 # Non-unit-clauses : 28 0.20/0.57 # Current number of unprocessed clauses: 452 0.20/0.57 # ...number of literals in the above : 922 0.20/0.57 # Current number of archived formulas : 0 0.20/0.57 # Current number of archived clauses : 55 0.20/0.57 # Clause-clause subsumption calls (NU) : 551 0.20/0.57 # Rec. Clause-clause subsumption calls : 441 0.20/0.57 # Non-unit clause-clause subsumptions : 89 0.20/0.57 # Unit Clause-clause subsumption calls : 5 0.20/0.57 # Rewrite failures with RHS unbound : 0 0.20/0.57 # BW rewrite match attempts : 9 0.20/0.57 # BW rewrite match successes : 9 0.20/0.57 # Condensation attempts : 198 0.20/0.57 # Condensation successes : 1 0.20/0.57 # Termbank termtop insertions : 19496 0.20/0.57 # Search garbage collected termcells : 2242 0.20/0.57 0.20/0.57 # ------------------------------------------------- 0.20/0.57 # User time : 0.027 s 0.20/0.57 # System time : 0.006 s 0.20/0.57 # Total time : 0.033 s 0.20/0.57 # Maximum resident set size: 2612 pages 0.20/0.57 0.20/0.57 # ------------------------------------------------- 0.20/0.57 # User time : 0.035 s 0.20/0.57 # System time : 0.009 s 0.20/0.57 # Total time : 0.044 s 0.20/0.57 # Maximum resident set size: 2080 pages 0.20/0.57 % E exiting 0.20/0.57 % E exiting 0.20/0.57 EOF